Using shared virtual memory for parallel join processing
نویسندگان
چکیده
منابع مشابه
Parallel Radiosity Using a Shared Virtual Memory
The radiosity method is a very demanding process in terms of computing and memory resources. To cope with these problems, parallel solutions have been proposed in the literature. These solutions are outlined and classiied in this paper. A new parallel solution, based on the use of a shared virtual memory (SVM), is proposed. It will be shown that this concept of SVM greatly simpliies the impleme...
متن کاملConngurable Shared Virtual Memory for Parallel Computing
Most distributed-shared memory(DSM) systems use a global address space which is shared by all processing nodes. Although the global address space is convenient in providing a single address space for programming models, it is applicable to DSM systems with relatively small number of processing nodes. As the system size grows, there is a problem with scalability. To avoid this drawback, a new sh...
متن کاملParallel Virtual Memory for Time Shared Environments
This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two di erent page management policies, namely, static and dynamic page allocation under two widely accepted scheduling policies: Gang scheduling and independent processor scheduling. The performance of each page management policy is studied under ...
متن کاملParallel Processing Shared Memory with Snoopy Cache
Implementation of Parallel Processing with snoopy cache is an idea to enhance the performance of computing in real-time. When we consider uniprocessor the execution will take sequential. In uniprocessor we may not face problems. When we come to multi-core processors in Parallel Processing the program is divided into slices and each slice may be independent or dependent. If it is independent the...
متن کاملParallel Discrete Event Simulation Using Shared Memory
Absrract-With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. We present a set of shared memory exper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1993
ISSN: 0163-5808
DOI: 10.1145/170036.170062